Synthesis of concurrent programs
نویسندگان
چکیده
منابع مشابه
Quantitative Synthesis for Concurrent Programs
We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis ...
متن کاملSynthesis of Large Concurrent Programs via Pairwise Composition
We present a tractable method for synthesizing arbitrarily large concurrent programs from speciications expressed in temporal logic. Our method does not explicitly construct the global state transition diagram of the program to be synthesized, and thereby avoids state explosion. Instead, it constructs a state transition diagram for each pair of component processes (of the program) that interact...
متن کاملAn Algorithmic Framework for Synthesis of Concurrent Programs
We present a framework that takes unsynchronized sequential processes along with a temporal specification of their global concurrent behaviour, and automatically generates a concurrent program with synchronization code ensuring correct global behaviour. The synthesized synchronization code is based on monitors with wait and notify operations on condition variables, and mutual-exclusion locks. N...
متن کاملSynthesis of Impartial Deadlock - free Programs for Concurrent Systems
This paper provides an algorithm for parallel program synthesi s. We study the particular but frequent case of sequential processes cooperation via shared resources. Given such a set of these processes (which may be non deterministic ones) , the algorithm outputs a parallel progra m which ensures safeness, liveness and fairness. The algorithm is divided in three parts: first it computes f or ea...
متن کاملSynthesis of Large Dynamic Concurrent Programs from Dynamic Specifications
We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The programs we synthesize are dynamic: new processes can be created and added at run-time, and so our programs are not finite-state, in general. Nevertheless, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Teaching Mathematics and Computer Science
سال: 2015
ISSN: 1589-7389
DOI: 10.5485/tmcs.2004.0062